Speciation based firefly algorithm for optimization in dynamic environments

نویسندگان

  • Babak Nasiri
  • M. R. Meybodi
چکیده

In many optimization problems in real world, objective function, design variable or constraints can be changed during time, so optimal value of these problems also can be changed. These kinds of problems are called dynamic. Algorithms which are designed for optimizing in these environments have some principles that distinguish them from algorithms designed in static environment. In this paper, for the first time, an algorithm based on firefly algorithm is proposed for optimization in dynamic environment. Firefly algorithm is a new meta-heuristic algorithm with a great potential for discovering multiple optima simultaneously. Mentioned ability of this algorithm has been used to propose a novel approach for multi-modal optimization in dynamic environments. The proposed approach evaluated on Moving peaks benchmark problem, which is the most famous benchmark for assessment in dynamic environments. The obtained results show the proper accuracy and convergence rate for the proposed approach in comparison with other well-known approaches. Page 1 of 1 Speciation based firefly algorithm for optimization in dynamic environments | Nasiri | ... 1/18/2012 http://ceser.in/ceserp/index.php/ijai/article/view/1285

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved speciation-based Firefly Algorithm in dynamic and uncertain environment

Many real-world optimization problems are dynamic in nature. The applied algorithm in this environment can pose serious challenges, especially when the search space is multimodal with multiple, time-varying optima. To address these challenges, this paper investigates a speciation-based firefly algorithm to enhance the population diversity with aim of generating several populations in different ...

متن کامل

History-driven firefly algorithm for optimisation in dynamic and uncertain environments

Due to dynamic and uncertain nature of many optimisation problems in real-world, the applied algorithm in this environment must be able to continuously track the changing optima over time. In this paper, we report a novel speciation-based firefly algorithm for dynamic optimisation, which improved its performance by employing prior landscape historical information. The proposed algorithm, namely...

متن کامل

Dynamic Replication based on Firefly Algorithm in Data Grid

In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed sy...

متن کامل

Improved Speciation-Based Firefly Algorithm in Dynamic and Uncertain Environments

Many real-world optimization problems are dynamic in nature. The applied algorithms in this environment can pose serious challenges, especially when the search space is multimodal with multiple, time-varying optima. To address these challenges, this paper proposed a speciation-based firefly algorithm to maintain the population diversity in different areas of the landscape. To improve the perfor...

متن کامل

Optimum Design of Scallop Domes for Dynamic Time History Loading by Harmony Search-Firefly Algorithm

This paper presents an efficient meta-heuristic algorithm for optimization of double-layer scallop domes subjected to earthquake loading. The optimization is performed by a combination of harmony search (HS) and firefly algorithm (FA). This new algorithm is called harmony search firefly algorithm (HSFA). The optimization task is achieved by taking into account geometrical and material nonlinear...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011